package mes.ap2.exo;

import io.Console;

public class Fibonacci {
   public static void main(String[] args) {
      int n = Console.readInt("n ? ");
//      versionIterative(n);
      versionRecursive(n);
   }

   static void versionIterative(int n) {
      int a = 0, b = 1, c = a+b;
      Console.print(b+" ");
      for(int i = 0; i < n-1; i++) {
         c = a+b;
         Console.println(c);
         a = b;
         b = c;
      }
   }

   static void versionRecursive(int n) {
      for(int i = 0; i < n; i++) {
         Console.println(fibo(i));
      }
   }

   static int fibo(int n) {
      return (n < 2) ? 1 : fibo(n-2) + fibo(n-1);
   }
}